Solving Critical Section problem in Distributed system by Entangled Quantum bits

In this paper we will propose a new approach to solve critical section problem in distributed system by taking advantage of a magical property of Quantum bits which known as entanglement. by this property the state of many quantum bit can be understood by measuring only one quantum bit. We tried to present a distributed algorithm with as minimum as possible message passing through the network. The current methods that solve this problem have tow main drawbacks one is bottleneck and single point of error another is many message per enter and exit into the critical section. Our algorithm is a distributed algorithm so it dose not have the first drawback. We showed Our proposed algorithm has constant number of message passing with high probability so the algorithm dose not have second problem too.